Mobile Anchor Route Scheduling with an Iterative Sensor Positioning Algorithm in Wireless Sensor Networks
نویسندگان
چکیده
Locating deployed sensor nodes in wireless networks is a crucial issue for general environmental monitoring applications. Most current positioning technologies use stationary anchors to compute the positions of nodes. However, placing static area not trivial job, especially hazardous environments. Applying mobile anchor good solution. This paper proposes an iterative (ISP) algorithm that uses neighboring-positioned assist locating unknown In addition, route scheduling method, named MARS, also proposed shorten traveling distance anchor. MARS projection mechanism and ISP reduce distance. Simulation results indicate can by about 21–49% compared with SCAN method. unfavorable scenario mechanism, still provides 34% less than The anchor, when applying able locate all only 45% 70% required one using method favorable algorithm, while reducing 15% 21% algorithm. non-ideal signal scenario, size 53% 74% Triangulation
منابع مشابه
3D Path Planning Algorithm for Mobile Anchor-Assisted Positioning in Wireless Sensor Networks
Positioning service is one of Wireless Sensor Networks’ (WSNs) fundamental services. The accurate position of the sensor nodes plays a vital role in many applications of WSNs. In this paper, a 3D positioning algorithm is being proposed, using mobile anchor node to assist sensor nodes in order to estimate their positions in a 3D geospatial environment. However, mobile anchor node’s 3D path optim...
متن کاملMobile anchor positioning for wireless sensor networks
Localisation is one of the most important issues in wireless sensor networks, because the location information is typically useful for coverage, deployment, routing, location service, target tracking and rescue operations in wireless sensor networks. The localisation protocols are classified into two categories: range-based protocol and range-free protocol. The range-based protocols employ dist...
متن کاملAn Energy Efficient Clustering Method using Bat Algorithm and Mobile Sink in Wireless Sensor Networks
Wireless sensor networks (WSNs) consist of sensor nodes with limited energy. Energy efficiency is an important issue in WSNs as the sensor nodes are deployed in rugged and non-care areas and consume a lot of energy to send data to the central station or sink if they want to communicate directly with the sink. Recently, the IEEE 802.15.4 protocol is employed as a low-power, low-cost, and low rat...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملMultiple Target Tracking in Wireless Sensor Networks Based on Sensor Grouping and Hybrid Iterative-Heuristic Optimization
A novel hybrid method for tracking multiple indistinguishable maneuvering targets using a wireless sensor network is introduced in this paper. The problem of tracking the location of targets is formulated as a Maximum Likelihood Estimation. We propose a hybrid optimization method, which consists of an iterative and a heuristic search method, for finding the location of targets simultaneously. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2022
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app13010022